package com.arron.algorithm.leetcodetop100.技巧.位操作;

public class 位1的个数 {


    public int hammingWeight(int n) {
        int res = 0;
        while (n!=0){
            n= n&(n-1);
            res++;
        }
        return res;
    }

}
